package com.Algorithm.Test;

import java.util.Stack;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: zjz
 * @Date: 2022/04/15/9:45
 * @Description:
 * @Target:
 */
public class kuoHaoChengFa {
    // (A1(A2(A3A4)))，(A1((A2A3)A4))，((A1A2)(A3A4))，((A1(A2A3))A4)，(((A1A2)A3)A4)。


    // 左括号就进递归，然后计算，右括号就出递归，计算默认1*,然后存入值
    // (11*5())()
    static int index;
    static void process(String ss){
        int firstNum = 1;
        int num = 0;

        Stack stack = new Stack();

        while (index<ss.length()){
        if (ss.charAt(index)=='('){
            process(ss);
        }

        if (ss.charAt(index)=='*'){

        }

        if (ss.charAt(index)>='0'&&ss.charAt(index)<='9'){
            num = (ss.charAt(index)-'0')+num*10;
        }




        }
    }
}
